Polynomial separable indefinite natural systems
نویسندگان
چکیده
منابع مشابه
Tutte polynomial expansions for 2-separable graphs
Let Ĝ be a graph obtained from a graph G with no loops or coloops by replacing each edge e= uw of G by a connected graph He that has only the vertices u and w in common with the rest of Ĝ. Two mutually dual formulas are proved for the Tutte polynomial of Ĝ in terms of parameters of the graphs He and (in the one case) 0ow polynomials of subgraphs of G or (in the other case) tension polynomials o...
متن کاملTimoshenko Systems with Indefinite Damping
We consider the Timoshenko system in a bounded domain (0, L) ⊂ R1. The system has an indefinite damping mechanism, i.e. with a damping function a = a(x) possibly changing sign, present only in the equation for the rotation angle. We shall prove that the system is still exponentially stable under the same conditions as in the positive constant damping case, and provided a = ∫ L 0 a(x) dx > 0 and...
متن کاملIndefinite waitings in MIRELA systems
MIRELA is a high-level language and a rapid prototyping framework dedicated to systems where virtual and digital objects coexist in the same environment and interact in real time. Its semantics is given in the form of networks of timed automata, which can be checked using symbolic methods. This paper shows how to detect various kinds of indefinite waitings in the components of such systems. The...
متن کاملDarboux Polynomials and First Integrals of Natural Polynomial Hamiltonian Systems
We show that for a natural polynomial Hamiltonian system the existence of a single Darboux polynomial (a partial polynomial first integral) is equivalent to the existence of an additional first integral functionally independent with the Hamiltonian function. Moreover, we show that, in a case when the degree of potential is odd, the system does not admit any proper Darboux polynomial, i.e., the ...
متن کاملMonomial-wise optimal separable underestimators for mixed-integer polynomial optimization
In this paper we introduce a new method for solving box-constrained mixed-integer polynomial problems to global optimality. The approach, a specialized branch-and-bound algorithm, is based on the computation of lower bounds provided by the minimization of separable underestimators of the polynomial objective function. The underestimators are the novelty of the approach because the standard appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Geometry and Physics
سال: 2015
ISSN: 0393-0440
DOI: 10.1016/j.geomphys.2014.07.026